A Tabelau Calculus for First Order Linear Temporal Logic over Bounded Time Structures (draft)

A Tableau Calculus for First Order Linear Temporal Logic over Bounded Time Structures

LTL Verification of Online Executions with Sensing in Bounded Situation Calculus

We look at agents reasoning about actions from a firstperson perspective. The agent has a representation of world as situation calculus action theory. It can perform sensing actions to acquire information. The agent acts “online”, i.e., it performs an action only if it is certain that the action can be executed, and collects sensing results from the actual world. When the agent reasons about it...

Norihiro Kamide TEMPORAL NON - COMMUTATIVE LOGIC : Expressing time , resource , order and hierarchy

A first-order temporal non-commutative logic TN[l], which has no structural rules and has some l-bounded linear-time temporal operators, is introduced as a Gentzen-type sequent calculus. The logic TN[l] allows us to provide not only time-dependent, resource-sensitive, ordered, but also hierarchical reasoning. Decidability, cut-elimination and completeness (w.r.t. phase semantics) theorems are s...

First Order Linear Temporal Logic over finite temporal structures is not semi-decidable (DRAFT)

The model of time underlying Linear Temporal Logic (LTL) is a discrete, linear sequence of states, usually taken to be bounded in the past and infinite in the future. In other words, the set of time points is isomorphic to IN. In the propositional case, several sound, complete and terminating proof-systems for LTL have been provided; see for instance [6, 5, 3, 2]. In [1] the problem of the exis...

Temporal Runtime Verification using Monadic Difference Logic

In this paper we present an algorithm for performing runtime verification of a bounded temporal logic over timed runs. The algorithm consists of three elements. First, the bounded temporal formula to be verified is translated into a monadic first-order logic over difference inequalities, which we call monadic difference logic. Second, at each step of the timed run, the monadic difference formul...